0.03/0.10 % Problem : SLH377^1 : TPTP v7.5.0. Released v7.5.0. 0.03/0.11 % Command : run_E %s %d THM 0.10/0.31 % Computer : n018.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 30 0.10/0.31 % WCLimit : 30 0.10/0.31 % DateTime : Tue Aug 9 02:57:00 EDT 2022 0.10/0.31 % CPUTime : 0.16/0.41 The problem SPC is TH0_THM_EQU_NAR 0.16/0.42 Running higher-order on 1 cores theorem proving 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.16/0.42 # Version: 3.0pre003-ho 5.00/5.26 # Preprocessing class: HSLSSMSSSSSNSFA. 5.00/5.26 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 5.00/5.26 # Starting new_ho_11 with 30s (1) cores 5.00/5.26 # new_ho_11 with pid 7109 completed with status 0 5.00/5.26 # Result found by new_ho_11 5.00/5.26 # Preprocessing class: HSLSSMSSSSSNSFA. 5.00/5.26 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 5.00/5.26 # Starting new_ho_11 with 30s (1) cores 5.00/5.26 # No SInE strategy applied 5.00/5.26 # Search class: HGHSM-FSLF31-MSFFFSBN 5.00/5.26 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 5.00/5.26 # Starting new_ho_10 with 17s (1) cores 5.00/5.26 # new_ho_10 with pid 7110 completed with status 0 5.00/5.26 # Result found by new_ho_10 5.00/5.26 # Preprocessing class: HSLSSMSSSSSNSFA. 5.00/5.26 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 5.00/5.26 # Starting new_ho_11 with 30s (1) cores 5.00/5.26 # No SInE strategy applied 5.00/5.26 # Search class: HGHSM-FSLF31-MSFFFSBN 5.00/5.26 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 5.00/5.26 # Starting new_ho_10 with 17s (1) cores 5.00/5.26 # Preprocessing time : 0.004 s 5.00/5.26 # Presaturation interreduction done 5.00/5.26 5.00/5.26 # Proof found! 5.00/5.26 # SZS status Theorem 5.00/5.26 # SZS output start CNFRefutation 5.00/5.26 thf(decl_22, type, times_times_nat: nat > nat > nat). 5.00/5.26 thf(decl_23, type, zero_zero_nat: nat). 5.00/5.26 thf(decl_24, type, produc1055075589od_a_a: list_P1467822637od_a_a > list_P1467822637od_a_a > list_P1891567085od_a_a). 5.00/5.26 thf(decl_25, type, produc778776796_a_a_a: list_P1467822637od_a_a > list_a > list_P319927492_a_a_a). 5.00/5.26 thf(decl_26, type, produc16441326od_a_a: list_a > list_P1467822637od_a_a > list_P1458844246od_a_a). 5.00/5.26 thf(decl_27, type, product_a_a: list_a > list_a > list_P1467822637od_a_a). 5.00/5.26 thf(decl_28, type, suc: nat > nat). 5.00/5.26 thf(decl_29, type, size_s1052379225od_a_a: list_P1891567085od_a_a > nat). 5.00/5.26 thf(decl_30, type, size_s736232240_a_a_a: list_P319927492_a_a_a > nat). 5.00/5.26 thf(decl_31, type, size_s1875148994od_a_a: list_P1458844246od_a_a > nat). 5.00/5.26 thf(decl_32, type, size_s642698393od_a_a: list_P1467822637od_a_a > nat). 5.00/5.26 thf(decl_33, type, size_size_list_a: list_a > nat). 5.00/5.26 thf(decl_34, type, ord_less_nat: nat > nat > $o). 5.00/5.26 thf(decl_35, type, ord_less_eq_nat: nat > nat > $o). 5.00/5.26 thf(decl_36, type, divide_divide_nat: nat > nat > nat). 5.00/5.26 thf(decl_37, type, k: nat). 5.00/5.26 thf(decl_38, type, n: nat). 5.00/5.26 thf(decl_39, type, xs: list_a). 5.00/5.26 thf(decl_40, type, esk1_1: (nat > $o) > nat). 5.00/5.26 thf(decl_41, type, esk2_1: (nat > $o) > nat). 5.00/5.26 thf(decl_42, type, esk3_1: nat > nat). 5.00/5.26 thf(decl_43, type, esk4_1: (nat > $o) > nat). 5.00/5.26 thf(decl_44, type, esk5_1: nat > nat). 5.00/5.26 thf(decl_45, type, esk6_1: (nat > $o) > nat). 5.00/5.26 thf(decl_46, type, esk7_1: (nat > nat > $o) > nat). 5.00/5.26 thf(decl_47, type, esk8_1: (nat > nat > $o) > nat). 5.00/5.26 thf(decl_48, type, esk9_1: (nat > nat > $o) > nat). 5.00/5.26 thf(decl_49, type, esk10_1: (nat > nat > $o) > nat). 5.00/5.26 thf(decl_50, type, esk11_1: (nat > $o) > nat). 5.00/5.26 thf(decl_51, type, esk12_1: (nat > $o) > nat). 5.00/5.26 thf(decl_52, type, esk13_3: nat > nat > (nat > $o) > nat). 5.00/5.26 thf(decl_53, type, esk14_3: nat > nat > (nat > $o) > nat). 5.00/5.26 thf(decl_54, type, esk15_3: nat > nat > (nat > nat > $o) > nat). 5.00/5.26 thf(decl_55, type, esk16_3: nat > nat > (nat > nat > $o) > nat). 5.00/5.26 thf(decl_56, type, esk17_3: nat > nat > (nat > nat > $o) > nat). 5.00/5.26 thf(decl_57, type, esk18_3: nat > nat > (nat > nat > $o) > nat). 5.00/5.26 thf(decl_58, type, esk19_2: nat > nat > nat). 5.00/5.26 thf(decl_59, type, esk20_2: nat > (nat > $o) > nat). 5.00/5.26 thf(decl_60, type, esk21_2: nat > (nat > $o) > nat). 5.00/5.26 thf(decl_61, type, esk22_2: nat > (nat > $o) > nat). 5.00/5.26 thf(decl_62, type, esk23_2: nat > (nat > $o) > nat). 5.00/5.26 thf(decl_63, type, esk24_2: nat > nat > nat). 5.00/5.26 thf(decl_64, type, esk25_2: nat > nat > nat). 5.00/5.26 thf(decl_65, type, esk26_1: (nat > nat) > nat). 5.00/5.26 thf(decl_66, type, esk27_1: (nat > nat) > nat). 5.00/5.26 thf(decl_67, type, esk28_2: nat > nat > nat). 5.00/5.26 thf(decl_68, type, esk29_1: nat > nat). 5.00/5.26 thf(decl_69, type, esk30_2: nat > (nat > $o) > nat). 5.00/5.26 thf(decl_70, type, esk31_2: nat > (nat > $o) > nat). 5.00/5.26 thf(decl_71, type, esk32_1: nat > nat). 5.00/5.26 thf(decl_72, type, esk33_2: nat > (nat > $o) > nat). 5.00/5.26 thf(decl_73, type, esk34_2: nat > (nat > $o) > nat). 5.00/5.26 thf(decl_74, type, esk35_1: (list_P1467822637od_a_a > $o) > list_P1467822637od_a_a). 5.00/5.26 thf(decl_75, type, esk36_1: (list_a > $o) > list_a). 5.00/5.26 thf(decl_76, type, esk37_1: nat > list_P1467822637od_a_a). 5.00/5.26 thf(decl_77, type, esk38_1: nat > list_a). 5.00/5.26 thf(decl_78, type, esk39_1: nat > nat). 5.00/5.26 thf(decl_79, type, esk40_1: (nat > $o) > nat). 5.00/5.26 thf(decl_80, type, esk41_3: (nat > $o) > nat > nat > nat). 5.00/5.26 thf(decl_81, type, esk42_2: nat > nat > nat). 5.00/5.26 thf(decl_82, type, esk43_2: nat > nat > nat). 5.00/5.26 thf(decl_83, type, esk44_2: nat > nat > nat). 5.00/5.26 thf(decl_84, type, esk45_2: nat > nat > nat). 5.00/5.26 thf(fact_133_mult_Ocommute, axiom, ((times_times_nat)=(^[X40:nat, X41:nat]:(times_times_nat @ X41 @ X40))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_133_mult_Ocommute)). 5.00/5.26 thf(fact_93_Euclidean__Division_Oless__mult__imp__div__less, axiom, ![X2:nat, X27:nat, X1:nat]:(((ord_less_nat @ X2 @ (times_times_nat @ X27 @ X1))=>(ord_less_nat @ (divide_divide_nat @ X2 @ X1) @ X27))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_93_Euclidean__Division_Oless__mult__imp__div__less)). 5.00/5.26 thf(conj_3, conjecture, (ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_3)). 5.00/5.26 thf(fact_29_linorder__neqE__nat, axiom, ![X11:nat, X12:nat]:((((X11)!=(X12))=>(~((ord_less_nat @ X11 @ X12))=>(ord_less_nat @ X12 @ X11)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_29_linorder__neqE__nat)). 5.00/5.26 thf(fact_67_not__less__eq, axiom, ![X2:nat, X1:nat]:((~((ord_less_nat @ X2 @ X1))<=>(ord_less_nat @ X1 @ (suc @ X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_67_not__less__eq)). 5.00/5.26 thf(fact_74_Suc__lessD, axiom, ![X2:nat, X1:nat]:(((ord_less_nat @ (suc @ X2) @ X1)=>(ord_less_nat @ X2 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_74_Suc__lessD)). 5.00/5.26 thf(fact_19_lessI, axiom, ![X1:nat]:((ord_less_nat @ X1 @ (suc @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_19_lessI)). 5.00/5.26 thf(conj_0, hypothesis, ((divide_divide_nat @ (size_size_list_a @ xs) @ k)=(suc @ n)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 5.00/5.26 thf(fact_99_nonzero__mult__div__cancel__left, axiom, ![X8:nat, X10:nat]:((((X8)!=(zero_zero_nat))=>((divide_divide_nat @ (times_times_nat @ X8 @ X10) @ X8)=(X10)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_99_nonzero__mult__div__cancel__left)). 5.00/5.26 thf(fact_27_n__not__Suc__n, axiom, ![X1:nat]:(((X1)!=(suc @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_27_n__not__Suc__n)). 5.00/5.26 thf(conj_1, hypothesis, ((k)!=(zero_zero_nat)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_1)). 5.00/5.26 thf(c_0_11, plain, ![X461:nat, X462:nat]:(((times_times_nat @ X461 @ X462)=(times_times_nat @ X462 @ X461))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_133_mult_Ocommute])])). 5.00/5.26 thf(c_0_12, plain, ![X715:nat, X716:nat, X717:nat]:((~(ord_less_nat @ X715 @ (times_times_nat @ X716 @ X717))|(ord_less_nat @ (divide_divide_nat @ X715 @ X717) @ X716))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_93_Euclidean__Division_Oless__mult__imp__div__less])])). 5.00/5.26 thf(c_0_13, negated_conjecture, ~(ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_3])])). 5.00/5.26 thf(c_0_14, plain, ![X801:nat, X802:nat]:(((times_times_nat @ X801 @ X802)=(times_times_nat @ X802 @ X801))), inference(variable_rename,[status(thm)],[c_0_11])). 5.00/5.26 thf(c_0_15, plain, ![X11:nat, X12:nat]:((((X11)!=(X12))=>(~(ord_less_nat @ X11 @ X12)=>(ord_less_nat @ X12 @ X11)))), inference(fof_simplification,[status(thm)],[fact_29_linorder__neqE__nat])). 5.00/5.26 thf(c_0_16, plain, ![X2:nat, X1:nat]:((~(ord_less_nat @ X2 @ X1)<=>(ord_less_nat @ X1 @ (suc @ X2)))), inference(fof_simplification,[status(thm)],[fact_67_not__less__eq])). 5.00/5.26 thf(c_0_17, plain, ![X645:nat, X646:nat]:((~(ord_less_nat @ (suc @ X645) @ X646)|(ord_less_nat @ X645 @ X646))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_74_Suc__lessD])])). 5.00/5.26 thf(c_0_18, plain, ![X506:nat]:((ord_less_nat @ X506 @ (suc @ X506))), inference(variable_rename,[status(thm)],[fact_19_lessI])). 5.00/5.26 thf(c_0_19, plain, ![X1:nat, X2:nat, X3:nat]:(((ord_less_nat @ (divide_divide_nat @ X1 @ X3) @ X2)|~((ord_less_nat @ X1 @ (times_times_nat @ X2 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_12])). 5.00/5.26 thf(c_0_20, hypothesis, ((divide_divide_nat @ (size_size_list_a @ xs) @ k)=(suc @ n)), inference(split_conjunct,[status(thm)],[conj_0])). 5.00/5.26 thf(c_0_21, negated_conjecture, ~((ord_less_nat @ (times_times_nat @ n @ k) @ (size_size_list_a @ xs))), inference(split_conjunct,[status(thm)],[c_0_13])). 5.00/5.26 thf(c_0_22, plain, ![X2:nat, X1:nat]:(((times_times_nat @ X1 @ X2)=(times_times_nat @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_14])). 5.00/5.26 thf(c_0_23, plain, ![X528:nat, X529:nat]:((((X528)=(X529))|((ord_less_nat @ X528 @ X529)|(ord_less_nat @ X529 @ X528)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])). 5.00/5.26 thf(c_0_24, plain, ![X624:nat, X625:nat]:((((ord_less_nat @ X624 @ X625)|(ord_less_nat @ X625 @ (suc @ X624)))&(~(ord_less_nat @ X625 @ (suc @ X624))|~(ord_less_nat @ X624 @ X625)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])). 5.00/5.26 thf(c_0_25, plain, ![X1:nat, X2:nat]:(((ord_less_nat @ X1 @ X2)|~((ord_less_nat @ (suc @ X1) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_17])). 5.00/5.26 thf(c_0_26, plain, ![X1:nat]:((ord_less_nat @ X1 @ (suc @ X1))), inference(split_conjunct,[status(thm)],[c_0_18])). 5.00/5.26 thf(c_0_27, hypothesis, ![X1:nat]:(((ord_less_nat @ (suc @ n) @ X1)|~((ord_less_nat @ (size_size_list_a @ xs) @ (times_times_nat @ X1 @ k))))), inference(spm,[status(thm)],[c_0_19, c_0_20])). 5.00/5.26 thf(c_0_28, negated_conjecture, ~((ord_less_nat @ (times_times_nat @ k @ n) @ (size_size_list_a @ xs))), inference(rw,[status(thm)],[c_0_21, c_0_22])). 5.00/5.26 thf(c_0_29, plain, ![X2:nat, X1:nat]:((((X1)=(X2))|(ord_less_nat @ X1 @ X2)|(ord_less_nat @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_23])). 5.00/5.26 thf(c_0_30, plain, ![X2:nat, X1:nat]:((~((ord_less_nat @ X1 @ (suc @ X2)))|~((ord_less_nat @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_24])). 5.00/5.26 thf(c_0_31, plain, ![X1:nat]:((ord_less_nat @ X1 @ (suc @ (suc @ X1)))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 5.00/5.26 thf(c_0_32, plain, ![X729:nat, X730:nat]:((((X729)=(zero_zero_nat))|((divide_divide_nat @ (times_times_nat @ X729 @ X730) @ X729)=(X730)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_99_nonzero__mult__div__cancel__left])])). 5.00/5.26 thf(c_0_33, hypothesis, ![X1:nat]:(((ord_less_nat @ (suc @ n) @ X1)|~((ord_less_nat @ (size_size_list_a @ xs) @ (times_times_nat @ k @ X1))))), inference(spm,[status(thm)],[c_0_27, c_0_22])). 5.00/5.26 thf(c_0_34, negated_conjecture, (((times_times_nat @ k @ n)=(size_size_list_a @ xs))|(ord_less_nat @ (size_size_list_a @ xs) @ (times_times_nat @ k @ n))), inference(spm,[status(thm)],[c_0_28, c_0_29])). 5.00/5.26 thf(c_0_35, plain, ![X1:nat]:(~((ord_less_nat @ (suc @ X1) @ X1))), inference(spm,[status(thm)],[c_0_30, c_0_31])). 5.00/5.26 thf(c_0_36, plain, ![X525:nat]:(((X525)!=(suc @ X525))), inference(variable_rename,[status(thm)],[fact_27_n__not__Suc__n])). 5.00/5.26 thf(c_0_37, plain, ![X1:nat, X2:nat]:((((X1)=(zero_zero_nat))|((divide_divide_nat @ (times_times_nat @ X1 @ X2) @ X1)=(X2)))), inference(split_conjunct,[status(thm)],[c_0_32])). 5.00/5.26 thf(c_0_38, negated_conjecture, ((times_times_nat @ k @ n)=(size_size_list_a @ xs)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35])). 5.00/5.26 thf(c_0_39, plain, ![X1:nat]:(((X1)!=(suc @ X1))), inference(split_conjunct,[status(thm)],[c_0_36])). 5.00/5.26 thf(c_0_40, hypothesis, ((k)!=(zero_zero_nat)), inference(split_conjunct,[status(thm)],[conj_1])). 5.00/5.26 thf(c_0_41, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_20]), c_0_39]), c_0_40]), ['proof']). 5.00/5.26 # SZS output end CNFRefutation 5.00/5.26 # Parsed axioms : 211 5.00/5.26 # Removed by relevancy pruning/SinE : 0 5.00/5.26 # Initial clauses : 350 5.00/5.26 # Removed in clause preprocessing : 42 5.00/5.26 # Initial clauses in saturation : 308 5.00/5.26 # Processed clauses : 3838 5.00/5.26 # ...of these trivial : 126 5.00/5.26 # ...subsumed : 1742 5.00/5.26 # ...remaining for further processing : 1970 5.00/5.26 # Other redundant clauses eliminated : 225 5.00/5.26 # Clauses deleted for lack of memory : 0 5.00/5.26 # Backward-subsumed : 50 5.00/5.26 # Backward-rewritten : 45 5.00/5.26 # Generated clauses : 186010 5.00/5.26 # ...of the previous two non-redundant : 175151 5.00/5.26 # ...aggressively subsumed : 0 5.00/5.26 # Contextual simplify-reflections : 62 5.00/5.26 # Paramodulations : 185740 5.00/5.26 # Factorizations : 31 5.00/5.26 # NegExts : 0 5.00/5.26 # Equation resolutions : 241 5.00/5.26 # Propositional unsat checks : 0 5.00/5.26 # Propositional check models : 0 5.00/5.26 # Propositional check unsatisfiable : 0 5.00/5.26 # Propositional clauses : 0 5.00/5.26 # Propositional clauses after purity: 0 5.00/5.26 # Propositional unsat core size : 0 5.00/5.26 # Propositional preprocessing time : 0.000 5.00/5.26 # Propositional encoding time : 0.000 5.00/5.26 # Propositional solver time : 0.000 5.00/5.26 # Success case prop preproc time : 0.000 5.00/5.26 # Success case prop encoding time : 0.000 5.00/5.26 # Success case prop solver time : 0.000 5.00/5.26 # Current number of processed clauses : 1636 5.00/5.26 # Positive orientable unit clauses : 52 5.00/5.26 # Positive unorientable unit clauses: 3 5.00/5.26 # Negative unit clauses : 46 5.00/5.26 # Non-unit-clauses : 1535 5.00/5.26 # Current number of unprocessed clauses: 171483 5.00/5.26 # ...number of literals in the above : 817776 5.00/5.26 # Current number of archived formulas : 0 5.00/5.26 # Current number of archived clauses : 282 5.00/5.26 # Clause-clause subsumption calls (NU) : 304014 5.00/5.26 # Rec. Clause-clause subsumption calls : 128796 5.00/5.26 # Non-unit clause-clause subsumptions : 1034 5.00/5.26 # Unit Clause-clause subsumption calls : 2187 5.00/5.26 # Rewrite failures with RHS unbound : 0 5.00/5.26 # BW rewrite match attempts : 105 5.00/5.26 # BW rewrite match successes : 60 5.00/5.26 # Condensation attempts : 3838 5.00/5.26 # Condensation successes : 85 5.00/5.26 # Termbank termtop insertions : 3653377 5.00/5.26 5.00/5.26 # ------------------------------------------------- 5.00/5.26 # User time : 4.695 s 5.00/5.26 # System time : 0.131 s 5.00/5.26 # Total time : 4.826 s 5.00/5.26 # Maximum resident set size: 3044 pages 5.00/5.26 5.00/5.26 # ------------------------------------------------- 5.00/5.26 # User time : 4.700 s 5.00/5.26 # System time : 0.133 s 5.00/5.26 # Total time : 4.833 s 5.00/5.26 # Maximum resident set size: 1872 pages 5.00/5.26 EOF